Interactive Logic Programming via Choice-Disjunctive Clauses
نویسنده
چکیده
Adding interaction to logic programming is an essential task. Expressive logics such as linear logic provide a theoretical basis for such a mechanism. Unfortunately, none of the existing linear logic languages can model interactions with the user. This is because they uses provability as the sole basis for computation. We propose to use the game semantics instead of provability as the basis for computation to allow for more active participation from the user. We illustrate our idea via Prolog⊕, an extension of Prolog with choice-disjunctive clauses. keywords: interaction, logic programming, linear logic, computability logic.
منابع مشابه
Clause-logical Aspects of the Smyth Powerdomain
Synopsis. In this paper we study the logical aspects of the Smyth powerdomain via clausal theories. The clause-theoretic view leads to an unexpectedly simple, operational, representation of the Smyth powerdomain. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a combinatorial lemma for the book-keeping of intermediate clauses. These results are moti...
متن کاملPartial Deduction in Disjunctive Logic Programming
CHIAKI SAKAMA AND HIROHISA SEKI y. This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal mode...
متن کاملTowards Interactive Object-Oriented Programming
To represent interactive objects, we propose a choice-disjunctive declaration statement of the form S⊔R where S,R are the (procedure or field) declaration statements within a class. This statement has the following semantics: request the user to choose one between S and R when an object of this class is created. This statement is useful for representing interactive objects that require interact...
متن کاملLogic Programs with Annotated Disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, we introduce a new formalism, Logic Programs with Annotated Disjunctions, based on disjunctive logic programs. In this formalism, each of the disjuncts in the head of a clause is annotated with a probability. Viewing such ...
متن کاملCH-Prolog: A Proof Procedure for Positive Disjunctive Logic Programming
The suc’ce.~ of Prolog motivat~ people to use full firstorder logic: instead of only Horn clauses as the b~is of logic programming. One of the main work in this extending is to seek proof procedure for new logic progrannning. Positive disjunctive logic programming extends Horn clause progrvanming by allowing more than one atoms re occur in the head o/’a program clause. In this paper we propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1307.7505 شماره
صفحات -
تاریخ انتشار 2013